Analyzing factors to convergence of genetic algorithm.
نویسندگان
چکیده
منابع مشابه
Convergence Models of Genetic Algorithm Selection Schemes
We discuss the use of normal distribution theory as a tool to model the convergence characteristics of di erent GA selection schemes The models predict the proportion of optimal alleles in function of the number of generations when optimizing the bit counting function The selection schemes analyzed are proportionate selection tournament selec tion truncation selection and elitist recombination ...
متن کاملConvergence Analysis of Quantum Genetic Algorithm
It is an important and a complicated task to investigate the convergence of a new genetic algorithm based on quantum mechanics concepts including qubits and superposition of states, namely Quantum Genetic Algorithm, in the field of evolutionary computation. This paper analyzes convergence property of quantum genetic algorithm which uses its special quantum operator instead of canonical operator...
متن کاملApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملAdaptive Reservoir Genetic Algorithm: Convergence Analysis
This paper extends the theoretical analysis of the Adaptive Reservoir Genetic Algorithm (ARGA), a variant of a Genetic Algorithm (GA) proposed by the authors in [4]. We show that ARGA visits the global optimum after a finite number of iterations with probability one, regardless of the initialization of the population. Key-Words: Genetic Algorithms, convergence analysis, adaptive control of search.
متن کاملEstimation of Distribution Immune Genetic Algorithm and Convergence Analysis
In the traditional immune genetic algorithm, crossover and mutation can disrupt the superior chromosome, so make the algorithm took a long time to converge to the best solution. The way of crossover and mutation based on marginal product model which can make the algorithm converge quickly was proposed in order to avoid the disruption of the superior chromosome. The pseudo parallel evolution mec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/19/2/1506